Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases

نویسندگان

  • Markus Rosenkranz
  • Georg Regensburger
  • Loredana Tec
  • Bruno Buchberger
چکیده

We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential algebras. The algebraic treatment of boundary problems brings up two new algebraic structures whose symbolic representation and computational realization is based on canonical forms in certain commutative and noncommutative polynomial domains. The first of these, the ring of integro-differential operators, is used for both stating and solving linear boundary problems. The other structure, called integro-differential polynomials, is the key tool for describing extensions of integrodifferential algebras. We use the canonical simplifier for integro-differential polynomials for generating an automated proof establishing a canonical simplifier for integro-differential operators. Our approach is fully implemented in the TH∃OREM∀ system; some code fragments and sample computations are included. Markus Rosenkranz School of Mathematics, Statistics and Actuarial Science (SMSAS), University of Kent, Canterbury CT2 7NF, United Kingdom, e-mail: [email protected] Georg Regensburger Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, 4040 Linz, Austria, INRIA Saclay – Île de France, Project DISCO, L2S, Supélec, 91192 Gif-sur-Yvette Cedex, France, e-mail: [email protected] Loredana Tec Research Institute for Symbolic Computation (RISC), Johannes Kepler University, 4032 Castle of Hagenberg, Austria, e-mail: [email protected] Bruno Buchberger Research Institute for Symbolic Computation (RISC), Johannes Kepler University, 4032 Castle of Hagenberg, Austria, e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic Computation for Moments and Filter Coefficients of Scaling Functions

Algebraic relations between discrete and continuous moments of scaling functions are investigated based on the construction of Bell polynomials. We introduce families of scaling functions which are parametrized by moments. Filter coefficients of scaling functions and wavelets are computed with computer algebra methods (in particular Gröbner bases) using relations between moments. Moreover, we p...

متن کامل

Combining Local Consistency, Symbolic Rewriting and Interval Methods

This paper is an attempt to address the processing of nonlinear numerical constraints over the Reals by combining three different methods: local consistency techniques, symbolic rewriting and interval methods. To formalize this combination, we define a generic two-step constraint processing technique based on an extension of the Constraint Satisfaction Problem, called Extended Constraint Satisf...

متن کامل

An Automated Confluence Proof for an Infinite Rewrite System Parametrized over an Integro-Differential Algebra

In our symbolic approach to boundary problems for linear ordinary differential equations we use the algebra of integro-differential operators as an algebraic analogue of differential, integral and boundary operators (Section 2). They allow to express the problem statement (differential equation and boundary conditions) as well as the solution operator (an integral operator called “Green’s opera...

متن کامل

A New Symbolic Method for Linear Boundary Value Problems Using Groebner Bases

Boundary value problems are of utmost importance for science and engineering. In fact, most differential equations come along with boundary conditions of some sort. It is therefore surprising that such problems—even in the linear case—have gained little attention in Symbolic Computation. Consequently, their coverage in computer algebra systems is rather unsystematic and unpredictable. The prope...

متن کامل

An Automated Confluence Proof for an Infinite Rewrite System via a Gröbner Basis Computation

In this paper we present an automated proof for the confluence of a rewrite system for integro-differential operators (given in Table 1). We also outline a generic prototype implementation of the integro-differential polynomials—the key tool for this proof—realized using the Theorema system. With its generic functor mechanism—detailed in Section 2—we are able to provide a formalization of the t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1210.2950  شماره 

صفحات  -

تاریخ انتشار 2010